正整数A和正整数B 的最小公倍数是指 能被A和B整除的最小的正整数值,设计一个算法,求输入A和B的最小公倍数。
数据范围:
def main(): a = input("") b = len(a) c = 0 while c < b - 1: if a[c] == " ": break c += 1 d = 0 e = "" while d < c: e += a[d] d += 1 f = c + 1 g = "" while f < len(a): g += a[f] f += 1 e = int(e) g = int(g) h = min(e, g) j = max(e, g) k = 2 while k <= h: if h % k == 0 and j % k == 0: h = h / k if h % k != 0: k += 1 else: k += 1 t = int(h * j) print(t) main()
#用递归方式模拟短除法 def back(num1:int,num2:int,res=1): m = min(num1,num2) if num1%num2 == 0&nbs***bsp;num2%num1==0: return max(num1,num2) else: for i in range(2,m+1): if num1%i==0 and num2%i==0: return back(num1//i,num2//i,res*i) return num1*num2*res a,b = map(int,input().split()) print(back(a,b))
n = input().split() a = int(n[0])#min b = int(n[1]) if a>b: a,b = b,a k = b while 1: if k%a==0 and k%b == 0: break else: k += b print(k)